Non - commutative computer algebra and molecular computing ∗ Svetlana Cojocaru
نویسندگان
چکیده
Non-commutative calculations are considered from the molecular computing point of view. The main idea is that one can get more advantage in using molecular computing for noncommutative computer algebra compared with a commutative one. The restrictions, connected with the coefficient handling in Gröbner basis calculations are investigated. Semigroup and group cases are considered as more appropriate. SAGBI basis constructions and possible implementations are discussed.
منابع مشابه
Interfaces to symbolic computation systems: reconsidering experience of Bergman
The article is based on experience of implementation of computer algebra system Bergman and on analysis of other symbolic computation systems. It is noted that many symbolic computation systems meet similar interface problems. Necessity of strict separation of calculation engine and interface shell, functions of these components, and requirements to them are motivated. The described approach wi...
متن کاملDirector of IMCS - National Prize Laureate of Moldova
Director of the Institute of Mathematics and Computer Science, Vice Editor-in-Chief of CSJM, and our colleague, D.Hab. Svetlana Cojocaru, in 2011 became the National Prize Laureate of Moldova. In accordance with Government decision, this distinction is given for “outstanding achievements whose results have substantially enriched science, culture and art, had a considerable contribution to promo...
متن کاملComputing one of Victor Moll's irresistible integrals with computer algebra
We investigate a certain quartic integral from V. Moll’s book “Irresistible Integrals” and demonstrate how it can be solved by computer algebra methods, namely by using non-commutative Gröbner bases. We present recent implementations in the computer algebra systems Singular and Mathematica.
متن کاملOn the commuting graph of non-commutative rings of order $p^nq$
Let $R$ be a non-commutative ring with unity. The commuting graph of $R$ denoted by $Gamma(R)$, is a graph with vertex set $RZ(R)$ and two vertices $a$ and $b$ are adjacent iff $ab=ba$. In this paper, we consider the commuting graph of non-commutative rings of order pq and $p^2q$ with Z(R) = 0 and non-commutative rings with unity of order $p^3q$. It is proved that $C_R(a)$ is a commutative ring...
متن کاملInvestigations on Natural Computing in the Institute of Mathematics and Computer Science
We describe the investigations on natural computing in the Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova during last fifteen years. Most of these investigations are inspired by results and ideas belonging to Corresponding Member of the Romanian Academy Gheorghe Păun.
متن کامل